Dynamic Output-sensitive Hidden Surface Removal for C-oriented Polyhedra

Hidden Surface Removal for C-oriented Polyhedra

In this paper we present anew, efficient, output-sensitive method for computing the visibility map of a set of c-oriented polyhedra (polyhedra with their faces and edges in c orientations, for some constant c) as seen from a given viewpoint. For non-intersecting polyhedra with n edges in total, the algorithm runs in time 0« n + k) log n), where k is the complexity ofthe visibility map. The meth...

Repetitive Hidden Surface Removal for Polyhedra

The repetitive hidden-surface-removal problem can be rephrased as the problem of nding the most compact representation of all views of a polyhedral scene that allows eecient on-line retrieval of a single view. In this paper we present a novel approach to this problem. We assume that a polyhedral scene in 3-space is given in advance and is preprocessed oo-line into a data structure. Afterwards, ...

Hidden Surface Removal for Axis-Parallel Polyhedra (Extended Abstract)

In this paper we present a new, efficient, outputsensitive method for computing the visibility map of a set of axis-parallel polyhedra (i.e., polyhedra with their faces and edges parallel to the coordinate axes) as seen from a given viewpoint. For non-intersecting polyhedra with n edges in total, the algorithm runs in time O( (n + k) log n), where k is the complexity of the visibility map. The ...

An efficient output-sensitive hidden-surface removal algorithm for polyhedral terrains

An Efficient Output-Sensitive Hidden-Surface Removal Algorithm for Polyhedral Terrains*

In this paper, we present an algorithm for hidden surface removal for a class of polyhedral surfaces which have a property that they can be ordered relatively quickly. For example, our results apply directly to terrain maps. A distinguishing feature of our algorithm is that its running time is sensitive to the actual size of the visible image, rather than the total number of intersections in th...